Finding cliques by quantum adiabatic evolution
نویسندگان
چکیده
منابع مشابه
Finding cliques by quantum adiabatic evolution
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An nvertex random graph has each edge included with probability 1 2 , and a clique is a completely conn...
متن کاملQuantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to ...
متن کاملQuantum search by local adiabatic evolution
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover’s problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate...
متن کاملQuantum search by partial adiabatic evolution
Quantum adiabatic computation has attracted a lot of attention in the past decades, such as [1, 3–10], since it was proposed by Farhi et al.[11]. In [5], an adiabatic algorithm was proposed to solve the Deutsch-Jozsa problem. The algorithm took an exponential time which provided only a quadratic speed up over the best classical algorithm for the problem. A modified algorithm proposed by Wei and...
متن کاملImproved Gap Estimates for Simulating Quantum Circuits by Adiabatic Evolution
We use elementary variational arguments to prove, and improve on, gap estimates which arise in simulating quantum circuits by adiabatic evolution. There are several models for quantum computation [5]. The quantum Turing machine model and the quantum circuit model, are equivalent in the sense that any algorithm that runs in polynomial time in one requires only polynomial time in the other. There...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2002
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic2.3-1